翻訳と辞書 Words near each other ・ "O" Is for Outlaw ・ "O"-Jung.Ban.Hap. ・ "Ode-to-Napoleon" hexachord ・ "Oh Yeah!" Live ・ "Our Contemporary" regional art exhibition (Leningrad, 1975) ・ "P" Is for Peril ・ "Pimpernel" Smith ・ "Polish death camp" controversy ・ "Pro knigi" ("About books") ・ "Prosopa" Greek Television Awards ・ "Pussy Cats" Starring the Walkmen ・ "Q" Is for Quarry ・ "R" Is for Ricochet ・ "R" The King (2016 film) ・ "Rags" Ragland ・ ! (album) ・ ! (disambiguation) ・ !! ・ !!! ・ !!! (album) ・ !!Destroy-Oh-Boy!! ・ !Action Pact! ・ !Arriba! La Pachanga ・ !Hero ・ !Hero (album) ・ !Kung language ・ !Oka Tokat ・ !PAUS3 ・ !T.O.O.H.! ・ !Women Art Revolution Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク computable isomorphism ： ウィキペディア英語版 computable isomorphism In computability theory two sets $A;B\; \backslash subseteq\; \backslash N$ of natural numbers are computably isomorphic or recursively isomorphic if there exists a total bijective computable function $f\; \backslash colon\; \backslash N\; \backslash to\; \backslash N$ with $f(A)\; =\; B$. By the theorem of Myhill,〔Theorem 7.VI, Hartley Rogers, Jr., ''Theory of recursive functions and effective computability''〕 the relation of computable isomorphism coincides with the relation of one-one reduction. Two numberings $\backslash nu$ and $\backslash mu$ are called computably isomorphic if there exists a computable bijection $f$ so that $\backslash nu\; =\; \backslash mu\; \backslash circ\; f$ Computably isomorphic numberings induce the same notion of computability on a set. == References == *. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「computable isomorphism」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.